🌳 Context free grammars - matmat · Scour

Distributional Learning of Context-Free Languages under Fixed Finite-Monoid Typing ⚙️Syntactic Monoids

Applying formal grammars in a custom programming language 📐Format Grammars

youtu.be·4d·r/programming

Abstract Machines for Logic Programs 🔍Type Inference

chrisistyping.bearblog.dev·2d·Lobsters, Hacker News, r/programming

The Recursive Descent 🌳Incremental Parsing

deadlime.hu·6d·Hacker News

Family Orienting Python Frozenset Dependent Type Theory λLambda Formalization

philipzucker.com·2d

DieSeL: Why Raku Grammars? 📝Concrete Syntax

rakujourney.wordpress.com·2d

A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata ⚙Automata Theory

Induction rules for Transition Algebra 🔍Type Inference

Learning Tree Automata with Term Rewriting ⚙️Syntactic Monoids

Memory-Efficient Looped Transformer: Decoupling Compute from Memory in Looped Language Models 📼Cassette Combinators

Probing Structural Mathematical Reasoning in Language Models with Algebraic Trapdoors 🧮SMT Solvers

CktFormalizer: Autoformalization of Natural Language into Circuit Representations 📐Format Grammars

A Foundation Model for Zero-Shot Logical Rule Induction 🤖Grammar Induction

Exact Regular-Constrained Variable-Order Markov Generation via Sparse Context-State Belief Propagation 🧮Kolmogorov Complexity

How Well Do LLMs Perform on the Simplest Long-Chain Reasoning Tasks: An Empirical Study on the Equivalence Class Problem 🧮SMT Solvers

A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers 🎞️Tape Combinatorics

SMT-Based Active Learning of Weighted Automata 🧮SMT Solvers

Gyan: An Explainable Neuro-Symbolic Language Model 💻Local LLMs

Rethinking Dense Sequential Chains: Reasoning Language Models Can Extract Answers from Sparse, Order-Shuffling Chain-of-Thoughts 🧮Prolog Parsing

Self-Programmed Execution for Language-Model Agents 🗣️Domain-Specific Languages

Log in to enable infinite scrolling